<title>最优二叉树</title><link href="http://hzoi.com/tomorrow.css" rel="stylesheet"><div class="ui existing segment"><pre><code><span class="pl-cm">/*</span>
<span class="pl-cm">2</span>
<span class="pl-cm">1 1 </span>
<span class="pl-cm">*/</span>
<span class="pl-cp">#include</span><span class="pl-cpf">&lt;cstdio&gt;</span><span class="pl-cp"></span>
<span class="pl-cp">#include</span><span class="pl-cpf">&lt;queue&gt;</span><span class="pl-cp"></span>
<span class="pl-k">using</span> <span class="pl-k">namespace</span> <span class="pl-n">std</span><span class="pl-p">;</span>
<span class="pl-kt">int</span> <span class="pl-n">n</span><span class="pl-p">;</span>
<span class="pl-kt">unsigned</span> <span class="pl-kt">long</span> <span class="pl-kt">long</span> <span class="pl-n">input</span><span class="pl-p">[</span><span class="pl-mi">55</span><span class="pl-p">];</span>

<span class="pl-kt">int</span> <span class="pl-nf">main</span><span class="pl-p">(){</span>
	<span class="pl-n">freopen</span><span class="pl-p">(</span><span class="pl-s">&quot;best.in&quot;</span><span class="pl-p">,</span><span class="pl-s">&quot;r&quot;</span><span class="pl-p">,</span><span class="pl-n">stdin</span><span class="pl-p">);</span>
	<span class="pl-n">freopen</span><span class="pl-p">(</span><span class="pl-s">&quot;best.out&quot;</span><span class="pl-p">,</span><span class="pl-s">&quot;w&quot;</span><span class="pl-p">,</span><span class="pl-n">stdout</span><span class="pl-p">);</span>
	<span class="pl-n">scanf</span><span class="pl-p">(</span><span class="pl-s">&quot;%d&quot;</span><span class="pl-p">,</span><span class="pl-o">&amp;</span><span class="pl-n">n</span><span class="pl-p">);</span>
	<span class="pl-n">priority_queue</span><span class="pl-o">&lt;</span><span class="pl-kt">unsigned</span> <span class="pl-kt">long</span> <span class="pl-kt">long</span><span class="pl-p">,</span><span class="pl-n">vector</span><span class="pl-o">&lt;</span><span class="pl-kt">unsigned</span> <span class="pl-kt">long</span> <span class="pl-kt">long</span><span class="pl-o">&gt;</span><span class="pl-p">,</span><span class="pl-n">greater</span><span class="pl-o">&lt;</span><span class="pl-kt">unsigned</span> <span class="pl-kt">long</span> <span class="pl-kt">long</span><span class="pl-o">&gt;</span> <span class="pl-o">&gt;</span> <span class="pl-n">min_q</span><span class="pl-p">;</span>
	<span class="pl-n">priority_queue</span><span class="pl-o">&lt;</span><span class="pl-kt">unsigned</span> <span class="pl-kt">long</span> <span class="pl-kt">long</span><span class="pl-o">&gt;</span> <span class="pl-n">max_q</span><span class="pl-p">;</span>
	<span class="pl-k">for</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">i</span><span class="pl-o">=</span><span class="pl-mi">0</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">&lt;</span><span class="pl-n">n</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">++</span><span class="pl-p">){</span>
		<span class="pl-n">scanf</span><span class="pl-p">(</span><span class="pl-s">&quot;%llu&quot;</span><span class="pl-p">,</span><span class="pl-o">&amp;</span><span class="pl-n">input</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">]);</span>
		<span class="pl-n">min_q</span><span class="pl-p">.</span><span class="pl-n">push</span><span class="pl-p">(</span><span class="pl-n">input</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">]);</span>
		<span class="pl-n">max_q</span><span class="pl-p">.</span><span class="pl-n">push</span><span class="pl-p">(</span><span class="pl-n">input</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">]);</span>
	<span class="pl-p">}</span>
	<span class="pl-k">for</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">i</span><span class="pl-o">=</span><span class="pl-mi">1</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">&lt;</span><span class="pl-n">n</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">++</span><span class="pl-p">){</span>
		<span class="pl-kt">unsigned</span> <span class="pl-kt">long</span> <span class="pl-kt">long</span> <span class="pl-n">a</span><span class="pl-p">,</span><span class="pl-n">b</span><span class="pl-p">;</span>
		<span class="pl-n">a</span><span class="pl-o">=</span><span class="pl-n">min_q</span><span class="pl-p">.</span><span class="pl-n">top</span><span class="pl-p">();</span><span class="pl-n">min_q</span><span class="pl-p">.</span><span class="pl-n">pop</span><span class="pl-p">();</span>
		<span class="pl-n">b</span><span class="pl-o">=</span><span class="pl-n">min_q</span><span class="pl-p">.</span><span class="pl-n">top</span><span class="pl-p">();</span><span class="pl-n">min_q</span><span class="pl-p">.</span><span class="pl-n">pop</span><span class="pl-p">();</span>
		<span class="pl-c1">//printf(&quot;&gt;&gt;%d &gt;&gt;%d &lt;&lt;%d\n&quot;,a,b,a*b+1);</span>
		<span class="pl-n">min_q</span><span class="pl-p">.</span><span class="pl-n">push</span><span class="pl-p">(</span><span class="pl-n">a</span><span class="pl-o">*</span><span class="pl-n">b</span><span class="pl-o">+</span><span class="pl-mi">1</span><span class="pl-p">);</span>
		
		<span class="pl-n">a</span><span class="pl-o">=</span><span class="pl-n">max_q</span><span class="pl-p">.</span><span class="pl-n">top</span><span class="pl-p">();</span><span class="pl-n">max_q</span><span class="pl-p">.</span><span class="pl-n">pop</span><span class="pl-p">();</span>
		<span class="pl-n">b</span><span class="pl-o">=</span><span class="pl-n">max_q</span><span class="pl-p">.</span><span class="pl-n">top</span><span class="pl-p">();</span><span class="pl-n">max_q</span><span class="pl-p">.</span><span class="pl-n">pop</span><span class="pl-p">();</span>
		<span class="pl-c1">//printf(&quot;&gt;&gt;%d &gt;&gt;%d &lt;&lt;%d\n&quot;,a,b,a*b+1);</span>
		<span class="pl-n">max_q</span><span class="pl-p">.</span><span class="pl-n">push</span><span class="pl-p">(</span><span class="pl-n">a</span><span class="pl-o">*</span><span class="pl-n">b</span><span class="pl-o">+</span><span class="pl-mi">1</span><span class="pl-p">);</span>
	<span class="pl-p">}</span>
	<span class="pl-n">printf</span><span class="pl-p">(</span><span class="pl-s">&quot;%llu</span><span class="pl-se">\n</span><span class="pl-s">%llu</span><span class="pl-se">\n</span><span class="pl-s">%llu</span><span class="pl-se">\n</span><span class="pl-s">&quot;</span><span class="pl-p">,</span><span class="pl-n">min_q</span><span class="pl-p">.</span><span class="pl-n">top</span><span class="pl-p">(),</span><span class="pl-n">max_q</span><span class="pl-p">.</span><span class="pl-n">top</span><span class="pl-p">(),</span><span class="pl-n">min_q</span><span class="pl-p">.</span><span class="pl-n">top</span><span class="pl-p">()</span><span class="pl-o">-</span><span class="pl-n">max_q</span><span class="pl-p">.</span><span class="pl-n">top</span><span class="pl-p">());</span>
	<span class="pl-k">return</span> <span class="pl-mi">0</span><span class="pl-p">;</span>
<span class="pl-p">}</span>
</cpde></pre></div>